Probabilistic complexity theory - PDFSEARCH.IO - Document Search Engine

Probabilistic complexity theory
Results: 385

#	Item
161	Homework Three, for Fri[removed]CSE 101 When specifying an algorithm, please use pseudocode that is simple and unambiguous. Always justify the correctness and running time of the algorithm, unless these are obvious. Add to Reading List Source URL: cseweb.ucsd.edu Language: English - Date: 2014-10-17 13:59:38 Applied mathematics Public-key cryptography Probabilistic complexity theory Electronic commerce RSA Finite fields Randomized algorithm Prime number Algorithm Cryptography Mathematics Primality tests
162	Proceedings of the 1999 ASME Design Engineering Technical Conferences September 12-15, 1999, Las Vegas, Nevada DETC99/DAC-8707 A SECOND-ORDER METHOD FOR ASSEMBLY TOLERANCE ANALYSIS Add to Reading List Source URL: www.sigmetrix.com Language: English - Date: 2013-05-18 22:23:30 Numerical analysis Differential calculus Monte Carlo method Probabilistic complexity theory Tolerance analysis Normal distribution Propagation of uncertainty Linearization Derivative Mathematics Mathematical analysis Statistics
163	Voting with CP-nets using a Probabilistic Preference Structure Cristina Cornelio, Umberto Grandi, Judy Goldsmith, Nicholas Mattei, Francesca Rossi and K. Brent Venable Abstract Add to Reading List Source URL: www.nickmattei.net Language: English - Date: 2014-12-08 19:50:53 Probabilistic complexity theory Probabilistically checkable proof
164	TWO KINDS OF PROBABILISTIC INDUCTION Ray Solomonoff Visiting Professor, Computer Learning Research Center Royal Holloway, University of London Mailing Address: P.O.B, Cambridge, Ma, U.S.A. Add to Reading List Source URL: world.std.com Language: English - Date: 2014-07-03 19:24:34 Algorithmic information theory Artificial intelligence Computability theory Probability interpretations Turing machine Ray Solomonoff Kolmogorov complexity Algorithmic probability Inductive inference Theoretical computer science Applied mathematics Theory of computation
165	On the P versus NP intersected with co-NP question in communication complexity Stasys Jukna Abstract Add to Reading List Source URL: lovelace.thi.informatik.uni-frankfurt.de Language: English - Date: 2007-08-30 03:42:23 Complexity classes Quantum complexity theory Mathematical optimization Models of computation NP Bounded-error probabilistic polynomial P versus NP problem PP Communication complexity Theoretical computer science Computational complexity theory Applied mathematics
166	Microsoft Word - combined report Add to Reading List Source URL: www.cofs.uwa.edu.au Language: English - Date: 2013-09-03 04:00:54 Mathematics Monte Carlo method Numerical analysis Probabilistic complexity theory Markov chain Shear strength Stochastic Probability Slope stability analysis Statistics Probability and statistics Markov models
167	A SCALABLE SYSTEM-ON-A-CHIP ARCHITECTURE FOR PRIME NUMBER VALIDATION Ray C.C. Cheung and Ashley Brown Department of Computing, Imperial College London, United Kingdom Abstract This paper presents a scalable SoC architect Add to Reading List Source URL: www.ashleybrown.co.uk Language: English - Date: 2010-09-16 09:55:04 Number theory Modular arithmetic Finite fields Probabilistic complexity theory Multiplication Miller–Rabin primality test Field-programmable gate array Montgomery reduction Randomized algorithm Mathematics Primality tests Cryptography
168	CALL FOR PAPERS ANALYSIS OF ALGORITHMS Special Issue in Algorithmica Average-Case Analysis of Algorithms is the area of Theoretical Computer Science that studies the behavior of algorithms on random inputs. The focus is Add to Reading List Source URL: algo.inria.fr Language: English - Date: 2004-11-13 12:22:28 Computer science Mathematics Probabilistic analysis of algorithms Algorithm Randomized algorithm Best worst and average case Combinatorics Amortized analysis Analysis of algorithms Applied mathematics Probabilistic complexity theory
169	SIAM J. COMPUT. Vol. 34, No. 4, pp. 848–862 c 2005 Society for Industrial and Applied Mathematics Add to Reading List Source URL: www.cs.ucy.ac.cy Language: English - Date: 2007-11-27 04:33:40 Analysis of algorithms Probabilistic complexity theory Randomized algorithm Directed acyclic graph Algorithm Distributed computing Computer architecture Cellular neural network Applied mathematics Theoretical computer science Mathematics
170	A NOTE ON MONTE CARLO PRIMALITY TESTS AND ALGORITHMIC INFORMATION THEORY Communications on Pure and Applied Add to Reading List Source URL: www.multimedialibrary.com Language: English - Date: 2014-03-05 10:33:18 Randomness Probabilistic complexity theory Modular arithmetic Randomized algorithm Primality certificate Prime number Monte Carlo algorithm Algorithmic information theory Gregory Chaitin Mathematics Primality tests Integer sequences

UPDATE